//Thu 21 Jan 2010 06:02:20 PM CST 
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

class SilverDistance
{
public:
	int minSteps(int sx, int sy, int gx, int gy)
	{
		int ret = 0;
		if((abs(sx-gx) + abs(sy-gy)) % 2 == 1)
			return max(abs(sx-gx),abs(sy+1-gy))+1;
		return max(abs(sx-gx),abs(sy-gy));
	}
};
